Simulation-based verification of implementations of incompletely specified Boolean functions
نویسنده
چکیده
The problem under discussion is to check whether a given system of incompletely specified Boolean functions is implemented by a logical description with functional indeterminacy that is represented by a system of connected blocks each of which is specified by a system of completely or incompletely specified Boolean functions. Simulationbased verification methods are considered which simulate the multi-block structure on the domain of the system of Boolean functions. The results of investigation of verification methods based on simulation of combinational circuits are given for the case of input stimuli represented by ternary vectors.
منابع مشابه
SAT-based verification of implementations of incompletely specified Boolean functions
The problem under discussion is to check whether a given system of incompletely specified Boolean functions is implemented by a logical description with functional indeterminacy that is represented by a system of connected blocks each of which is specified by a system of completely or incompletely specified Boolean functions. SAT-based verification methods are considered which formulate the ver...
متن کاملVerification of logical descriptions with functional indeterminacy
The problem under discussion is to check whether a given system of incompletely specified Boolean functions is implemented by a logical description with functional indeterminacy that is represented by a system of connected blocks each of which is specified by a system of completely or incompletely specified Boolean functions. Simulation based and SAT based verification methods are considered. T...
متن کاملUsing Sat for Combinational Implementation Checking
The problem of checking whether a system of incompletely specified Boolean functions is implemented by the given combinational circuit is considered. The task is reduced to testing out if two given logical descriptions are equivalent on the domain of one of them having functional indeterminacy. We present a novel SAT-based verification method that is used for testing whether the given circuit s...
متن کاملB . Becker , R . E . Bryant , O . Coudert , Ch . Meinel ( Hrsg
s of the Talks 7 Probabilistic Analysis of Large Finite State Machines F. Somenzi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 On Improving OBDD-Based Verification in a Synthesis Environment W. Kunz . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 On Computing the Maximum Power Cycle of Sequential Circuits A. Pardo . . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملFixed Polarity Reed-muller Minimization of Incompletely Specified Boolean Functions Based on Information Estimations on Decision Trees
This paper presents algorithm to find minimal Fixed Polarity Reed-Muller expressions, twolevel fixed polarity AND-EXOR canonical representations, for incompletely specified Boolean functions that based on information measures on decision trees. We study the Free Reed-Muller Tree as acceptable representation and manipulation structure to find minimal Fixed Polarity Reed-Muller expressions. In co...
متن کامل